A Genetic Algorithm for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems

نویسنده

  • Temel Öncan
چکیده

In this work we introduce a Genetic Algorithm (GA) for the Order Batching Problem considering traversal and return routing policies. The proposed GA has been tested on randomly generated instances and compared with the wellknown savings algorithm. According to our extensive computational experiments we can say that the proposed GA yields promising solutions in acceptable computation times.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

متن کامل

A Solution Approach for the Joint Order Batching and Picker Routing Problem in a Two-Block Layout

Order Batching and Picker Routing Problems arise in warehouses when articles have to be retrieved from their storage location in order to satisfy a given demand specified by customer orders. The Order Batching Problem includes the grouping of a given set of customer orders into feasible picking orders such that the total length of all picker tours is minimized. The problem of determining the se...

متن کامل

Joint order batching and picker Manhattan routing problem

In picking product items in a warehouse to fulfill customer orders, a practical way is to classify similar orders as the same batch and then to plan the optimal picker routing when picking each batch of items. Different from the previous problems, this work investigates the joint order batching and picker Manhattan routing problem, which simultaneously determines the optimal order batching allo...

متن کامل

Data-driven warehouse optimization: deploying skills of order pickers

Batching orders and routing order pickers is a commonly studied problem in many picker-to-parts warehouses. The impact of individual differences in picking skills on performance has received little attention. In this paper, we show that taking into account differences in the skills of individual pickers when assigning work has a substantial effect on total batch execution time and picker produc...

متن کامل

General Variable Neighborhood Search applied to the picking process in a warehouse

The order batching problem is a part of the picking process of items in a warehouse. A set of items conform an order and a set of orders conform a batch. The problem consist of grouping the orders received in the warehouse in different batches. Each batch have to be collected by a single picker without exceed a capacity limit. The objective is to minimize the total time needed to collect all th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013